Independence results for variants of sharply bounded induction
نویسنده
چکیده
The theory T 0 2 , axiomatized by the induction scheme for sharply bounded formulas in Buss’ original language of bounded arithmetic (with bx/2c but not bx/2yc), has recently been unconditionally separated from full bounded arithmetic S2. The method used to prove the separation is reminiscent of those known from the study of open
منابع مشابه
A Remark on Independence Results for Sharply Bounded Arithmetic
The purpose of this note is to show that the independence results for sharply bounded arithmetic of Takeuti 4] and Tada and Tatsuta 3] can be obtained and, in case of the latter, improved by the model-theoretic method developed by the author in 2]. By sharply bounded arithmetic we understand fragments of the theory S 1 2 of Bounded Arithmetic of Buss 1] given by the quantiier-free BASIC axioms ...
متن کاملA Model Theoretic Property of Sharply Bounded Formulae, with some Applications
We deene a property of substructures of models of arithmetic, that of being length-initial , and show that sharply bounded formulae are absolute between a model and its length-initial submodels. We use this to prove independence results for some weak fragments of bounded arithmetic by constructing appropriate models as length-initial submodels of some given model.
متن کاملThe strength of sharply bounded induction
We prove that the sharply bounded arithmetic T 0 2 in a language containing the function symbol ⌊ x 2y ⌋ (often denoted by MSP) is equivalent to PV1.
متن کاملAlternative approaches to obtain t-norms and t-conorms on bounded lattices
Triangular norms in the study of probabilistic metric spaces as a special kind of associative functions defined on the unit interval. These functions have found applications in many areas since then. In this study, we present new methods for constructing triangular norms and triangular conorms on an arbitrary bounded lattice under some constraints. Also, we give some illustrative examples for t...
متن کاملPreservation theorems for bounded formulas
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each of these properties. These results provide simple proofs for some known results in the model theory of the bounded arithmetic theories like CPV and PV1. We use the mentioned results to obtain some independence results i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 162 شماره
صفحات -
تاریخ انتشار 2011